-
1 свойство совместного вложения
Русско-английский морской словарь > свойство совместного вложения
-
2 свойство совместного вложения
Русско-английский математический словарь > свойство совместного вложения
-
3 оператор вложения
-
4 свойство совместного вложения
Русско-английский научный словарь > свойство совместного вложения
-
5 теорема вложения
-
6 свойство совместного вложения
Русско-английский военно-политический словарь > свойство совместного вложения
-
7 вложение
с. мат. вчт. embedding, imbedding; nesting -
8 инвариантное вложение
Русско-английский большой базовый словарь > инвариантное вложение
-
9 инвариантное вложение
-
10 строгое вложение
-
11 инвариантное вложение
Русско-английский словарь по информационным технологиям > инвариантное вложение
-
12 строгое вложение
Русско-английский словарь по информационным технологиям > строгое вложение
-
13 инвариантное вложение
Русско-английский новый политехнический словарь > инвариантное вложение
-
14 свойство
n. property, character;
свойства - characteristics;
свойство конечной покрываемое - finite cover property (f.c.p)
свойство независимости - independence property;
свойство порядка - order property;
свойство размерностного порядка - dimensional order property (dop)
свойство совместного вложения - joint embedding property;
свойство строгого порядка - strict order property -
15 свойство
-
16 свойство совместного вложения
Mathematics: joint embedding propertyУниверсальный русско-английский словарь > свойство совместного вложения
См. также в других словарях:
Age (model theory) — In model theory, a branch of mathematical logic, the age of a structure (or model) A is the class of all finitely generated structures which are embeddable in A (i.e. isomorphic to substructures of A ). This concept is central in the construction … Wikipedia
India — /in dee euh/, n. 1. Hindi, Bharat. a republic in S Asia: a union comprising 25 states and 7 union territories; formerly a British colony; gained independence Aug. 15, 1947; became a republic within the Commonwealth of Nations Jan. 26, 1950.… … Universalium
United States — a republic in the N Western Hemisphere comprising 48 conterminous states, the District of Columbia, and Alaska in North America, and Hawaii in the N Pacific. 267,954,767; conterminous United States, 3,022,387 sq. mi. (7,827,982 sq. km); with… … Universalium
Dirac delta function — Schematic representation of the Dirac delta function by a line surmounted by an arrow. The height of the arrow is usually used to specify the value of any multiplicative constant, which will give the area under the function. The other convention… … Wikipedia
Recurrence plot — In descriptive statistics and chaos theory, a recurrence plot (RP) is a plot showing, for a given moment in time, the times at which a phase space trajectory visits roughly the same area in the phase space. In other words, it is a graph of… … Wikipedia
Mapping of Unicode characters — Unicode’s Universal Character Set has a potential capacity to support over 1 million characters. Each UCS character is mapped to a code point which is an integer between 0 and 1,114,111 used to represent each character within the internal logic… … Wikipedia
Knots and graphs — Knots and graph theory are related in some simple ways. The triangle is associated with the trefoil knot. Contents 1 Knot diagram … Wikipedia
Austria — Austrian, adj., n. /aw stree euh/, n. a republic in central Europe. 8,054,078; 32,381 sq. mi. (83,865 sq. km). Cap.: Vienna. German, Österreich. * * * Austria Introduction Austria Background: Once the center of power for the large Austro… … Universalium
Mutual information — Individual (H(X),H(Y)), joint (H(X,Y)), and conditional entropies for a pair of correlated subsystems X,Y with mutual information I(X; Y). In probability theory and information theory, the mutual information (sometimes known by the archaic term… … Wikipedia
Center of Excellence in Nanotechnology at AIT — Center of Excellence at AIT CoEN @ AIT Motto There is no sky to limit us at the bottom Type Center of Excellence Endowment … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia